Note on Range-Finding

A Note on Rule-Finding Abduction

The rulending abduction is an abduction which begins with the observation of a surprising fact, nds a rule in the set of programs, and proposes a hypothesis. This paper investigates such rulending abduction for logic programming from two viewpoints: termination and analogical reasoning. In order to discuss the termination of rulending abduction, we introduce two concepts of loop-pair and loop-e...

A note on finding minimum mean cycle

In a directed graph with edge weights, the mean weight of a directed cycle is the weight of its edges divided by their number. The minimum cycle mean of the graph is the minimum mean weight of a cycle. Karp gave a characterization of minimum cycle mean and an O(nm) algorithm to compute it, where n is the number of vertices and m is the number of edges. However, an algorithm he suggested for ide...

A note on finding optimum branchings

The subject of t h i s note i s Tarjan's aZgorithm for finding an optimum branching in a directed graph. ed out, namely (i) an incorrect cZaim invoZving branching uniqueness, and (ii) an imprecise way of updating edge vaZues i n each i terat ion. val idi ty of the algorithm. I t is s h m here that they may be f ixed v i a a simpZe modification, which Zeaves unchanged the overall time and space ...

Laser Range Finding Based on Correlation Method

The purpose of the paper is to present a new laser diode range finding method. The system belongs to the category of flight time measurement. The optical power of the laser diode beam is modulated and then both emitted and returned signals are compared in order to obtain the delay or distance information. The new method is an estimation of the distance by correlation computation. The main advan...

A Note on Range-Restricted Circuit Covers